Computational complexity

Results: 2253



#Item
811Sequence alignment / A5/1 / Multiple sequence alignment / Bioinformatics / Computational phylogenetics / Science

Introduction Complexity and Algorithms Experiments

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2012-12-29 15:25:36
812Graph theory / Complexity classes / NP / Graph isomorphism / NP-complete problems / Theoretical computer science / Computational complexity theory / Mathematics

Compactness-Preserving Mapping on Trees Jan Baumbach, Jiong Guo, Rashid Ibragimov Network Alignment Comparison of networks/graphs

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2014-06-13 17:44:22
813Analysis of algorithms / Cache / Computational complexity theory / Search algorithms / B-tree / Trie / Cache-oblivious algorithm / Suffix tree / Time complexity / Theoretical computer science / Computer science / Computing

Cache-Oblivious Index for Approximate String Matching

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2007-07-27 14:38:02
814Superstring theory / Computer science / Mathematics / Computational complexity theory / Approximation algorithm / NP-complete

Algorithms for Three Versions of the Shortest Common Superstring Problem Maxime Crochemore, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2010-08-20 17:45:58
815Probability theory / Advantage / Oracle machine / Standard model / Oracle Corporation / Pseudorandom function family / Random function / Computational complexity theory / Pseudorandomness / Cryptography / Cryptographic hash functions / Random oracle

The Random Oracle Methodology, Revisited∗ Ran Canetti† Oded Goldreich‡ Shai Halevi§

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2003-08-01 15:32:21
816NP-complete problems / Complexity classes / Mathematical optimization / Analysis of algorithms / Parameterized complexity / Exponential time hypothesis / NP-complete / Time complexity / Feedback vertex set / Theoretical computer science / Computational complexity theory / Applied mathematics

Lower bounds based on the Exponential Time Hypothesis Daniel Lokshtanov∗ Dániel Marx†

Add to Reading List

Source URL: www.win.tue.nl

Language: English - Date: 2013-05-30 15:14:06
817Computer science / Philosophy of artificial intelligence / Computability theory / Human–computer interaction / Turing machine / Turing test / Computing Machinery and Intelligence / Universal Turing machine / Computational complexity theory / Alan Turing / Artificial intelligence / Science

Chapter 3 Artificial Knowledge 3.1 Introduction

Add to Reading List

Source URL: www.eeng.dcu.ie

Language: English - Date: 2003-03-18 07:33:16
818Applied mathematics / Hashing / Suffix tree / Hash function / Hash table / Vertex cover / Bloom filter / Universal hashing / Time complexity / Theoretical computer science / Search algorithms / Computational complexity theory

Guide to Examinable Material COMS31900 – Advanced AlgorithmsDecember 2013 Overview This guide is organised topic by topic in the same order that the course was taught. References into the lectures are giv

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:17
819NP-complete problems / Analysis of algorithms / Computability theory / Complexity classes / Parameterized complexity / Dominating set / Time complexity / Computable function / Parameter / Theoretical computer science / Computational complexity theory / Applied mathematics

1 Fixed-Parameter Tractability In this chapter, we introduce parameterized problems and the notion of fixed-parameter tractability. We start with an informal discussion that highlights the main issues behind the definiti

Add to Reading List

Source URL: lii.rwth-aachen.de

Language: English - Date: 2014-02-04 08:14:43
820Operations research / Theoretical computer science / Multi-objective optimization / Pareto efficiency / Routing / Algorithm / Shortest path problem / Computational complexity theory / Ant colony optimization algorithms / Mathematical optimization / Mathematics / Applied mathematics

Multi-Objective Optimisation on Transportation Networks Dan Costelloe, Peter Mooney and Adam Winstanley. Department of Computer Science, National University of Ireland Maynooth (NUIM), Co. Kildare. Ireland. Telephone: +3

Add to Reading List

Source URL: itcnt05.itc.nl

Language: English - Date: 2005-02-02 17:00:00
UPDATE